Self-Stabilizing k-out-of-l exclusion on tree networks
نویسندگان
چکیده
In this paper, we address the problem of k-out-of-l Exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l Exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bounded local memory for each process.
منابع مشابه
Self-stabilizing K-out-of-L exclusion on tree network
In this paper, we address the problem of k-out-of-l exclusion, a generalization of the mutual exclusion problem, in which there are l units of a shared resource, and any process can request up to k units (1 ≤ k ≤ l). We propose the first deterministic self-stabilizing distributed k-out-of-l exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...
متن کاملSelf-Stabilizing k-out-of-! Exclusion on Tree Networks
In this paper, we address the problem of k-out-of-! exclusion, a generalization of the mutual exclusion problem, in which there are ! units of a shared resource, and any process can request up to k units (1 ≤ k ≤ !). We propose the first deterministic self-stabilizing distributed k-out-of-! exclusion protocol in message-passing systems for asynchronous oriented tree networks which assumes bound...
متن کاملSelf-Stabilizing k-out-of-ℓ Exclusion in Tree Networks
In this paper, we address the problem of k-out-of-` exclusion, a generalization of the mutual exclusion problem, in which there are ` units of a shared resource, and any process can request up to k units (1 ≤ k ≤ `). A protocol is self-stabilizing if, starting from an arbitrary configuration, be it initial state or after a corrupted state, the protocol can start behaving normally within a finit...
متن کاملSelf-Stabilizing -out-of- Exclusion
In this paper, self-stabilizing asynchronous distributed algorithms are given for the -out-ofexclusion problem, a generalization of the mutual exclusion problem, in which there are units of a resource, and any process can request up to units. We consider two network topologies, a tree and a unidirectional ring. The networks are anonymous except for one distinguished process. The ring algorithm ...
متن کاملColor Optimal Self-Stabilizing Depth-First Token Circulation
The notion of self-stabilization was rst introduced by Dijkstra : it is the property for a system to eventually recover itself a legitimate state after any perturbation modifying the memory state. This paper proposes a self-stabilizing depth-rst token circulation protocol for uniform rooted networks. Such an algorithm is very convenient to obtain the mutual exclusion or to construct a spanning ...
متن کامل